Fast Stereo Matching using Adaptive Window based Disparity Refinement
نویسندگان
چکیده
منابع مشابه
Fast Stereo Matching using Adaptive Window based Disparity Refinement
Aiming at the trade-off between accuracy and efficiency in current local stereo matching, a fast stereo matching method based on adaptive window is proposed. The census transform combined with absolute differences (AD) is used for matching cost initialization. Then an iterative cost aggregation based on exponential step adaptive weight (ESAW) is adopted to improve the parallelism and execution ...
متن کاملReal-Time Stereo Matching using Adaptive Window based Disparity Refinement
In this paper, we propose a real-time stereo matching method based on adaptive window, aiming at the trade-off between accuracy and efficiency in current local stereo matching, Considering that the Census transform has good adaptability to image amplitude distortion, but may introduce matching ambiguities in regions with noise or similar local structures, we combine the Census transform with AD...
متن کاملFast Dense Stereo Matching Using Adaptive Window in Hierarchical Framework
A new area-based stereo matching in hierarchical framework is proposed. Local methods generally measure the similarity between the image pixels using local support window. An appropriate support window, where the pixels have similar disparity, should be selected adaptively for each pixel. Our algorithm consists of the following two steps. In the first step, given an estimated initial disparity ...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملFast Adaptive Graph-Cuts Based Stereo Matching
Stereo vision is one of the central research problems in computer vision. The most difficult and important issue in this area is the stereo matching process. One technique that performs this process is the Graph-Cuts based algorithm and which provides accurate results [1]. Nevertheless, this approach is too slow to use due to the redundant computations that it invokes. In this work, an Adaptive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multimedia Theory and Applications
سال: 2016
ISSN: 2368-5956
DOI: 10.11159/jmta.2016.001